منابع مشابه
Computable Analysis Over the Generalized Baire Space
One of the main goals of computable analysis is that of formalizing the complexity of theorems from real analysis. In this setting Weihrauch reductions play the role that Turing reductions do in standard computability theory. Via coding, we can transfer computability and topological results from the Baire space ω to any space of cardinality 2א0 , so that e.g. functions over R can be coded as fu...
متن کاملOn Borel equivalence relations in generalized Baire space
We construct two Borel equivalence relations on the generalized Baire space κ, κ = κ > ω, with the property that neither of them is Borel reducible to the other. A small modification of the construction shows that the straightforward generalization of the Glimm-Effros dichotomy fails. By λ we denote the set of all functions κ→ λ. We define a topology to (λ) by letting the sets N(η1...,ηn) = {(f...
متن کاملTopological Ramsey spaces and metrically Baire sets
We characterize a class of topological Ramsey spaces such that each element R of the class induces a collection {Rk}k<ω of projected spaces which have the property that every Baire set is Ramsey. Every projected space Rk is a subspace of the corresponding space of length-k approximation sequences with the Tychonoff, equivalently metric, topology. This answers a question of S. Todorcevic and gen...
متن کاملGeneralized Ramsey Theory for Multiple Colors
In this paper, we study the generalized Ramsey number r(G, , . . ., Gk) where the graphs GI , . . ., Gk consist of complete graphs, complete bipartite graphs, paths, and cycles. Our main theorem gives the Ramsey number for the case where G 2 , . . ., G,, are fixed and G, ~_C, or P,, with n sufficiently large . If among G2 , . . ., G k there are both complete graphs and odd cycles, the main theo...
متن کاملAn Extremal Problem in Generalized Ramsey Theory
A connected graph G of order n is called m-good if r(Km ,G) = (m-1)(n-1) + 1 . Let f(m,n) be the largest integer q such that every connected graph of order n and size q is m-good and let g(m,n) be the largest q for which there exists a connected graph G of order n and size q which is m-good . Asymptotic bounds are given for f and g . 1 . Tntroduction . One of the most notable yet simply proved ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 2018
ISSN: 0166-8641
DOI: 10.1016/j.topol.2017.12.019